Low - Complexity Bit - Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields 1
نویسندگان
چکیده
| We present a new low-complexity bit-parallel canonical basis multiplier for the eld GF2 m generated by a n all-one-polynomial. The proposed canon-ical basis multiplier requires m 2 , 1 XOR gates and m 2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملLow-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2 m ) generated by an all-onepolynomial. The proposed canonical basis multiplier requires m 2 1 XOR gates and m 2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.
متن کاملA New Low Complexity Parallel Multiplier for a Class of Finite Fields
In this paper a new low complexity parallel multiplier for characteristic two finite fields GF (2) is proposed. In particular our multiplier works with field elements represented through both Canonical Basis and Type I Optimal Normal Basis (ONB), provided that the irreducible polynomial generating the field is an All One Polynomial (AOP). The main advantage of the scheme is the resulting space ...
متن کاملA New Construction of Massey-Omura Parallel Multiplier over GF(2m)
ÐThe Massey-Omura multiplier of GF 2m uses a normal basis and its bit parallel version is usually implemented using m identical combinational logic blocks whose inputs are cyclically shifted from one another. In the past, it was shown that, for a class of finite fields defined by irreducible all-one polynomials, the parallel Massey-Omura multiplier had redundancy and a modified architecture o...
متن کاملNormal Basis Multiplication Algorithm for GF ( 2 n ) ( Full Version )
In this paper, we propose a new normal basis multiplication algorithm for GF(2). This algorithm can be used to design not only fast software algorithms but also low complexity bit-parallel multipliers in some GF(2)s. Especially, for some values of n that no Gaussian normal basis exists in GF(2), i.e., 8|n, this algorithm provides an alternative way to construct low complexity normal basis multi...
متن کامل